Special Issue: Interactive Theorem Proving

نویسندگان

  • ANDREA ASPERTI
  • JEREMY AVIGAD
چکیده

This special issue of Mathematical Structures in Computer Science is devoted to the theme of 'Interactive theorem proving and the formalisation of mathematics'. The formalisation of mathematics started at the turn of the 20th century when mathematical logic emerged from the work of Frege and his contemporaries with the invention of the formal notation for mathematical statements called predicate calculus. This notation allowed the formulation of abstract general statements over possibly infinite domains in a uniform way, and thus went well beyond propositional calculus, which goes back to Aristotle and only allowed tautologies over unquantified statements. At the International Congress of Mathematicians in 1900, Hilbert presented a list of 23 unsolved problems, the first of which being the design of an axiomatic system for mathematics capable of internally proving its own consistency. The search for a solution to this problem had profound implications for mathematical practice since it led Cantor and others to investigate set theory and its foundations in axiomatic systems expressed in variants of predicate calculus. Some kind of consensus was reached with the first-order axiomatisation of Zermelo and Fraenkel, possibly complemented with the axiom of choice (ZFC), but mysteries remained, such as the derivability of the continuum hypothesis, or even it soundness. It was unclear whether set theory was too strong (and possibly inconsistent) or too weak (and unable to prove its own consistency). The matter was settled by Gödel, who destroyed all hopes of finding a consistent axiomatic system able to prove its own consistency. The best we could do is relative consistency proofs, such as Gödel's result that the continuum hypothesis is indeed consistent with ZFC. This is hardly satisfactory from a foundational point of view, but this line of research led to a consolidation of mathematical logic around two complementary points of view: proof theory along with the arithmetisation of syntax on the one hand and model theory within set theory on the other. Furthermore, the precise formulation of

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrating Automated and Interactive Theorem Proving in Type Theory

We introduce an approach of integrating automated theorem proving techniques into the interactive theorem prover Agda. Our approach is generic and flexible, and can be combined with dependently typed programming. We have implemented the special cases of SAT solving and CTL model checking. The tool has been used for verifying the correctness of railway interlocking systems.

متن کامل

An Architecture for Extensible Click’n Prove Interfaces

We present a novel software architecture for graphical interfaces to interactive theorem provers. It provides click’n prove functionality at the interface level without requiring support from the underlying theorem prover and enables users to extend that functionality through light-weight plugins. Building on established architectural and design patterns for interactive and extensible systems, ...

متن کامل

Integrating Automated and Interactive Theorem Proving

This paper highlights a project to integrate interactive and automated theorem proving in Software Veriication. Its aim is to combine the advantages of the two paradigms. We report on the integration concepts, and on the experimental results with a prototype implementation .

متن کامل

Interactive Theorem Proving, First International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010. Proceedings

Why should wait for some days to get or receive the interactive theorem proving first international conference itp 2010 edinburgh uk july 11 14 2010 book that you order? Why should you take it if you can get the faster one? You can find the same book that you order right here. This is it the book that you can receive directly after purchasing. This interactive theorem proving first internationa...

متن کامل

An Interactive Theorem Proving Assistant

This paper describes WinKE, an interactive proof assistant, which is based on the KE calculus. The software has been designed to serve as a tutoring system supporting the teaching of logic and theorem proving through KE.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011